Adaptive Markov Chain Monte Carlo: Theory and Methods
نویسندگان
چکیده
In general, the transition probability P of the Markov chain depends on some tuning parameter θ defined on some space Θ which can be either finite dimensional or infinite dimensional. The success of the MCMC procedure depends crucially upon a proper choice of θ. To illustrate, consider the standard Metropolis-Hastings (MH) algorithm. For simplicity, we assume that π has a density also denoted by π with respect to the Lebesgue measure on X = R endowed with its Borel σ-field X . Given that the chain is at x, a candidate y is sampled from a proposal transition density q(x, ·) and is accepted with probability α(x, y) defined as
منابع مشابه
A Markov Chain Perspective on Adaptive Monte Carlo Algorithms
This paper discusses some connections between adaptive Monte Carlo algorithms and general state space Markov chains. Adaptive algorithms are iterative methods in which previously generated samples are used to construct a more efficient sampling distribution at the current iteration. In this paper, we describe two such adaptive algorithms, one arising in a finite-horizon computation of expected ...
متن کاملAccelerated Adaptive Markov Chain for Partition Function Computation
We propose a novel Adaptive Markov Chain Monte Carlo algorithm to compute the partition function. In particular, we show how to accelerate a flat histogram sampling technique by significantly reducing the number of “null moves” in the chain, while maintaining asymptotic convergence properties. Our experiments show that our method converges quickly to highly accurate solutions on a range of benc...
متن کاملBootstrap Markov chain Monte Carlo and optimal solutions for the Law of Categorical Judgment (Corrected)
A novel procedure is described for accelerating the convergence of Markov chain Monte Carlo computations. The algorithm uses an adaptive bootstrap technique to generate candidate steps in the Markov Chain. It is efficient for symmetric, convex probability distributions, similar to multivariate Gaussians, and it can be used for Bayesian estimation or for obtaining maximum likelihood solutions wi...
متن کاملAdaptive MCMC Methods for Inference on Dis- cretely Observed Affine Jump Diffusion Models
In the present paper we generalize in a Bayesian framework the inferential solution proposed by Eraker, Johannes & Polson (2003) for stochastic volatility models with jumps and affine structure. We will use an adaptive sampling methodology known as Delayed Rejection suggested in Tierney & Mira (1999) in a Markov Chain Monte Carlo settings in order to reduce the asymptotic variance of the estima...
متن کاملMarkov Chain Monte Carlo methods: Implementation and comparison
The paper and presentation will focus on MCMC methods, implemented together in MC2Pack, an ox package which allows you to run a range of sampling algorithm (MH, Gibbs, Griddy Gibbs, Adaptive Polar Importance Sampling, Adaptive Polar Sampling, and Adaptive Rejection Metropolis Sampling) on a given posterior. Computation of the marginal likelihood for the model is also done automatically, allowin...
متن کامل